Optimal Balanced Semi-Matchings for Weighted Bipartite Graphs
نویسندگان
چکیده
منابع مشابه
Optimum matchings in weighted bipartite graphs
Given an integer weighted bipartite graph {G = (U ⊔ V,E), w : E → Z} we consider the problems of finding all the edges that occur in some minimum weight matching of maximum cardinality and enumerating all the minimum weight perfect matchings. Moreover, we construct a subgraph Gcs of G which depends on an ǫ-optimal solution of the dual linear program associated to the assignment problem on {G,w}...
متن کاملGroup Weighted Matchings in Bipartite Graphs
Let G be a bipartite graph with bicoloration {A, B}, |A| = |B|, and let w : E(G) -» K where K is a finite abelian group with k elements. For a subset S c E(G) let w(S) = IIeE s (e).A Perfect matching M c E(G) is a w-matching if w(M) = 1. A characterization is given for all w's for which every perfect matching is a w-matching. It is shown that if G = Kk+1,k+1 then either G has no w-matchings or ...
متن کاملSemi-matchings for Bipartite Graphs and Load Balancing
We consider the problem of fairly matching the left-hand vertices of a bipartite graph to the right-hand vertices. We refer to this problem as the optimal semimatching problem; it is a relaxation of the known bipartite matching problem. We present a way to evaluate the quality of a given semi-matching and show that, under this measure, an optimal semi-matching balances the load on the right han...
متن کاملBipartite Graphs and Perfect Matchings
When we think about markets creating opportunities for interaction between buyers and sellers, there is an implicit network encoding the access between buyers and sellers. In fact, there are several ways to use networks to model buyer-seller interaction, and here we discuss some of them. First, consider the case in which not all buyers have access to all sellers. There could be several reasons ...
متن کاملInduced matchings in bipartite graphs
All graphs in this paper are understood to be finite, undirected, without loops or multiple edges. The graph G' = (V', E') is called an induced subgraph of G = (V, E) if V' ~ V and uv E E' if and only if {u, v} ~ V', uv E E. The following two problems about induced matchings have been formulated by Erdos and Nesetril at a seminar in Prague at the end of 1985: 1. Determine f(k, d), the maximum n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Digital Courier
سال: 2007
ISSN: 1349-7456
DOI: 10.2197/ipsjdc.3.693